package com.geticsen.leetcode;

public class MergeTwoSortedLists {

    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode cur = l1;
        while (l2 != null && cur != null) {
            if (l2.val<l1.val){

            }
            l2 = l2.next;
        }
        return l1;
    }
}
